Complete graph

Results: 868



#Item
31arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Add to Reading List

Source URL: www.grupolys.org

Language: English - Date: 2016-05-11 06:39:57
32CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-10-27 18:59:34
33Prof. Roger Wattenhofer http://www.dcg.ethz.ch Semester/Master Thesis Distributed Graph Coloring Motivation and Informal Description

Prof. Roger Wattenhofer http://www.dcg.ethz.ch Semester/Master Thesis Distributed Graph Coloring Motivation and Informal Description

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:01
34Inference, Models and Simulation for Complex Systems CSCI, Fall 2011 Prof. Aaron Clauset Problem Set 4, dueFor some of these problems, you will likely need to refer to our networks text Networks: An

Inference, Models and Simulation for Complex Systems CSCI, Fall 2011 Prof. Aaron Clauset Problem Set 4, dueFor some of these problems, you will likely need to refer to our networks text Networks: An

Add to Reading List

Source URL: tuvalu.santafe.edu

Language: English - Date: 2011-10-11 23:14:50
35TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: comopt.ifi.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
36I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge

I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:53
37OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
38Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess

Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-10-28 15:42:58
39LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
40Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2

Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2006-08-23 14:28:28